To Score or Not to Score? Structural Estimation of Sponsored Search Auctions

نویسندگان

  • Yu-Wei Hsieh
  • Matthew Shum
  • Sha Yang
چکیده

We estimate a structural model of a sponsored search auction model. The econometric model matches two pieces of data for each auction: (i) the allocation of sponsored search listing to the bidders; and (ii) the per-click prices paid by the winners. To accommodate the “position paradox”, our model relaxes the assumption of decreasing click volumes with position ranks, which is often assumed in the literature. We estimate the model using data from the Chinese online marketplace Taobao.com. We find that sellers of different qualities adopt different bidding strategies: high quality sellers bid more aggressively for informative keywords, while low quality sellers are more likely to be sorted to the top positions for vague keywords. Counterfactual evaluations show that score weighting in sponsored search auctions would dramatically increase the per-click price for the top ad position, but leave prices for lower positions largely unaffected.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

To Score or Not to Score? Estimates of a Sponsored Search Auctions Model

We estimate a structural model of sponsored search auctions at “Website X”, one of the largest online marketplaces in China. We use the estimates to address the distributional and revenue impact of “scoring” the auction, which is a way for shopping websites to reward larger merchants (by penalizing smaller merchants). We find evidence of horizontal differentiation in preferences, as merchants o...

متن کامل

Division of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 to Score or Not to Score? Estimates of a Sponsored Search Auction Model

We estimate a structural model of a sponsored search auction model. To accommodate the “position paradox”, we relax the assumption of decreasing click volumes with position ranks, which is often assumed in the literature. Using data from “Website X”, one of the largest online marketplaces in China, we find that merchants of different qualities adopt different bidding strategies: high quality me...

متن کامل

Efficient Ranking in Sponsored Search

In the standard model of sponsored search auctions, an ad is ranked according to the product of its bid and its estimated click-through rate (known as the quality score), where the estimates are taken as exact. This paper re-examines the form of the efficient ranking rule when uncertainty in click-through rates is taken into account. We provide a sufficient condition under which applying an exp...

متن کامل

Algorithmic Methods for Sponsored Search Advertising

Modern commercial Internet search engines display advertisements along side the search results in response to user queries. Such sponsored search relies on market mechanisms to elicit prices for these advertisements, making use of an auction among advertisers who bid in order to have their ads shown for specific keywords. We present an overview of the current systems for such auctions and also ...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014